The hardness of intervalizing four colored caterpillars
نویسندگان
چکیده
The problem of Intervalizing Colored Graphs (ICG) has received a lot of attention due to their use as a model for DNA physical mapping with ambiguous data. If k is the number of colors, the problem is known to be NP-Complete for general graphs for k 4 and has polynomial time algorithms for k = 2 and k = 3. In this paper we show that the ICG problem is NP-complete when the graph is a caterpillar tree, colored with k 4 colors, strengthen the cases for which the problem remains diicult.
منابع مشابه
The Proper Interval Colored Graph Problem for Caterpillar Trees
This paper studies the computational complexity of the Proper interval colored graph problem (picg), when the input graph is a colored tree. We show that the problem is hard for the class of caterpillar trees. To prove our result we make use of a close relationship between intervalizing problems and graph layout problems. We deene a graph layout problem the Proper colored layout problem (pclp)....
متن کاملThe Hardness of Problems on Thin Colored Graphs
In this paper, we consider the complexity of a number of combinatorial problems; namely, Intervalizing Colored Graphs (DNA physical mapping), Triangulating Colored Graphs (perfect phylogeny), (Directed) (Modified) Colored Cutwidth, Feasible Register Assignment and Module Allocation for graphs of bounded treewidth. Each of these problems has as a characteristic a uniform upper bound on the tree ...
متن کاملThe hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs
In this paper, we consider the complexity of a number of combinatorial problems; namely, Intervalizing Colored Graphs (DNA physical mapping), Trian-gulating Colored Graphs (perfect phylogeny), (Directed) (Modified) Colored Cutwidth, Feasible Register Assignment and Module Allocation for graphs of bounded pathwidth. Each of these problems has as a characteristic a uniform upper bound on the tree...
متن کاملOn the proper intervalization of colored caterpillar trees
This paper studies the computational complexity of the Proper interval colored graph problem (picg), when the input graph is a colored caterpillar, parameterized by hair length. In order prove our result we establish a close relationship between the picg and a graph layout problem the Proper colored layout problem (pclp). We show a dichotomy: the picg and the pclp are NP-complete for colored ca...
متن کاملThe hardness of perfect phylogeny , feasible register assignment and other problems on thin colored graphs ( Hans
In this paper, we consider the complexity of a number of combinatorial problems; namely, INTERVALIZING COLORED GRAPHS (DNA PHYSICAL MAPPING), TRIANGULATING COLORED GRAPHS (PERFECT PHYLOGENY), (DIRECTED) (MODIFIED) COLORED CUTWIDTH, FEASIBLE REGISTER ASSIGNMENT and MODULE ALLOCATION FOR GRAPHS OF BOUNDED PATHWIDTH. Each of these problems has as a characteristic a uniform upper bound on the tree ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 235 شماره
صفحات -
تاریخ انتشار 2001